A Weak Characterisation of the Delaunay Triangulation
نویسنده
چکیده
We consider a new construction, the weak Delaunay triangulation of a finite point set in a metric space, which contains as a subcomplex the traditional (strong) Delaunay triangulation. The two simplicial complexes turn out to be equal for point sets in Euclidean space, as well as in the (hemi)sphere, hyperbolic space, and certain other geometries. There are weighted and approximate versions of the weak and strong complexes in all these geometries, and we prove equality theorems in those cases also. On the other hand, for discrete metric spaces the weak and strong complexes are decidedly different. We give a short empirical demonstration that weak Delaunay complexes can lead to dramatically clean results in the problem of estimating the homology groups of a manifold represented by a finite point sample.
منابع مشابه
Variational characterisation of Gibbs measures with Delaunay triangle interaction
This paper deals with stationary Gibbsian point processes on the plane with an interaction that depends on the tiles of the Delaunay triangulation of points via a bounded triangle potential. It is shown that the class of these Gibbs processes includes all minimisers of the associated free energy density and is therefore nonempty. Conversely, each such Gibbs process minimises the free energy den...
متن کاملCharacterisation and generalisation of cartographic lines using Delaunay triangulation
A method is presented for generalising cartographic lines using an approach based on determination of their structure. Constrained Delaunay triangulation is used to construct a skeleton of the space surrounding the lines and hence represent line features in terms of skeleton branches. Several statistical measures are used to characterise the triangulation branches. The measures enable selective...
متن کاملAdaptive Image Segmentation by Combining Photometric Invariant Region and Edge Information
ÐAn adaptive image segmentation scheme is proposed employing the Delaunay triangulation for image splitting. The tessellation grid of the Delaunay triangulation is adapted to the semantics of the image data by combining region and edge information. To achieve robustness against imaging conditions (e.g., shading, shadows, illumination, and highlights), photometric invariant similarity measures, ...
متن کاملA weak definition of Delaunay triangulation
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it applies to hyperbolic and hemispherical geometries and to Edelsbrunner’s weighted Delaunay triangulation. In spherical geometry, we establish a similar theorem...
متن کاملCombining Region Splitting and Edge Detection through Guided Delaunay Image Subdivision
In this paper, an adaptive split-and-merge segmen-tation method is proposed. The splitting phase of the algorithm employs the in-cremental Delaunay triangulation competent of forming grid edges of arbitrary orientation and position. The tessellation grid, deened by the Delaunay trian-gulation, is adjusted to the semantics of the image data by combining similarity and diierence information among...
متن کامل